Improved Layout for Data Flow Diagrams with Port Constraints
نویسندگان
چکیده
The automatic generation of graphical views for data flow models and the efficient development of such models require layout algorithms that are able to handle their specific requirements. Examples include constraints on the placement of ports as well as the proper handling of nested models. We present an algorithm for laying out data flow diagrams that improves earlier approaches by reducing the number of edge crossings and bend points. We validate the quality of our algorithm with a range of models drawn from Ptolemy, a popular modeling tool for the design of embedded systems.
منابع مشابه
Drawing layered graphs with port constraints
Complex software systems are often modeled using data flow diagrams, in which nodes are connected to each other through dedicated connection points called ports. The influence a layout algorithm has on the placement of ports is determined by port constraints defined on the corresponding node. In this paper we present approaches for integrating port constraints into the layer-based approach to g...
متن کاملPort Constraints in Hierarchical Layout of Data Flow Diagrams
We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practice. The KIELER framework aims at improving this by offering novel user interaction techniques, enabled by automatic layout of the diagrams. In this paper we present extensions of the well-known hierarchical layout approach, ori...
متن کاملSpecial issue on diagram aesthetics and layout: Guest editors' introduction
$ Diagrams are an integral part of many visual languages. For diagrams to be an effective and efficient means of communication and visualisation, a layout often has to be produced from data sets that include little or no geometric information. The resulting layout has significant impact on the ability of users to accurately interpret the information contained in the diagrams. Moreover, the choi...
متن کاملCrossing Minimization and Layouts of Directed Hypergraphs with Port Constraints
Many practical applications for drawing graphs are modeled by directed graphs with domain specific constraints. In this paper, we consider the problem of drawing directed hypergraphs with (and without) port constraints, which cover multiple real-world graph drawing applications like data flow diagrams and electric schematics. Most existing algorithms for drawing hypergraphs with port constraint...
متن کاملResearch on Visualization of Port Transportation Network based on Force Directed Model
Visualization technology has been extensive used in various fields which makes the information presented in a visual way. Visualization directly improves the cognitive efficiency of information, greatly reduces the complexity of data understanding, and breaks through the limitation of the traditional statistical analysis method. The automatic placement of nodes and edges in the network graph ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012